Learning Plan Libraries for Case-based Plan Recognition
نویسنده
چکیده
This paper addresses the indexing and retrieval issues in the context of the case-based plan recognition. The indexing and storage mechanisms utilize the knowledge about planning situations that enable the recognizer to focus its search to a subset of the plan library containing relevant past plans. A two-level abstract indexing scheme, along with the incremental construction of the plan libraries, may significantly reduce the retrieval efforts of the recognizer. Adding a third level of indexing may also improve the retrieval, but it may be computationally too expensive for some planning domains. Experimental results show the next action prediction accuracy with and without utilization of the two-level indexing scheme.
منابع مشابه
Supporting Interleaved Plans in Learning Hierarchical Plan Libraries for Plan Recognition
Most of the available plan recognition techniques are based on the use of a plan library in order to infer user’s intentions and/or strategies. Until some years ago, plan libraries were completely hand coded by human experts, which is an expensive, error prone and slow process. Besides, plan recognition systems with hand-coded plan libraries are not easily portable to new domains, and the creat...
متن کاملA New Model for Automatic Generation of Plan Libraries for Plan Recognition
The problem of generating plan libraries for plan recognition (the inverse of the planning problem), has gained much importance in recent years, because of the dependence of the existing plan recognition techniques on them, and the difficulty of the problem. Even when there is considerable work related to the plan recognition process itself, less work has been done on the generation of such pla...
متن کاملHeuristics for Planning, Plan Recognition and Parsing
In a recent paper, we have shown that Plan Recognition over STRIPS can be formulated and solved using Classical Planning heuristics and algorithms (Ramirez and Geffner 2009). In this work, we show that this formulation subsumes the standard formulation of Plan Recognition over libraries through a compilation of libraries into STRIPS theories. The libraries correspond to AND/OR graphs that may b...
متن کاملFlexible Plan-Subplan Matching for Plan Recognition in Case-Based Agents
Plan-subplan matching is an important step in case-based plan recognition. We present RelaxedVF2, an algorithm for plan-subplan matching for plans encoded using the Action Sequence Graph representation. RelaxedVF2 is a subgraph monomorphism algorithm that affords flexibility and error tolerance for plan-subplan matching. We present a study comparing RelaxedVF2 with an alternate degreesequence m...
متن کاملString Shuffling over a Gap between Parsing and Plan Recognition
We propose a new probabilistic plan recognition algorithm YR based on an extension of Tomita’s Generalized LR (GLR) parser for grammars enriched with the shuffle operator. YR significantly outperforms previous approaches based on topdown parsers, shows more consistent run times among similar libraries, and degrades more gracefully as plan library complexity increases. YR also lifts the restrict...
متن کامل